A Maximum Principle for Combinatorial Yamabe Flow

نویسندگان

  • David Glickenstein
  • Feng Luo
چکیده

In his proof of Andreev’s theorem, Thurston in [1] introduced a conformal geometric structure on two dimensional simplicial complexes which is an analogue of a Riemannian metric. He then used a version of curvature to prove the existence of circle-packings (see also Marden-Rodin [2] for more exposition). Techniques very similar to elliptic partial differential equation techniques were used by Y. Colin de Verdière [3] to study conformal structures and circle packings. Cooper and Rivin in [4] then defined a version of scalar curvature on three dimensional simplicial complexes and used it to look at rigidity of sphere packings along the lines of Colin de Verdière. Inspired by this work, Chow and Luo [5] looked at a combinatorial Ricci flow on two dimensional simplicial complexes and showed that the equation satisfies a maximum principle. The maximum principle, which says that the maximum of a solution decreases and the minimum increases, is one of the most useful concepts in the study of the heat equation and other parabolic partial differential equations. Maximum principle techniques have been used to great benefit in the smooth category. We are especially inspired by Hamilton’s work on the Ricci flow (see [6]). It is in general very difficult to prove a maximum principle, or even to prove short term existence of solutions, when you do not have a strictly parabolic equation. We shall use Cooper and Rivin’s combinatorial scalar curvature to define combinatorial Yamabe flow on three dimensional simplicial complexes with conformal structures which is a three dimensional analogue of Chow and Luo’s work. The flow turns out not to be parabolic in the usual sense of Laplacians on graphs. We shall nonetheless prove a maximum principle for this equation under certain conditions. Our treatment works on the simplest examples: the curvature flow on a double tetrahedron and the boundary of a 4-simplex. Numerical studies indicate that the maximum principle is true under less restrictive conditions, perhaps even under only topological restrictions. The combinatorial Yamabe flow is a way of studying prescribed scalar curvature on simplicial complexes, which we might call the combinatorial Yamabe

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A combinatorial Yamabe flow in three dimensions

A combinatorial version of Yamabe flow is presented based on Euclidean triangulations coming from sphere packings. The evolution of curvature is then derived and shown to satisfy a heat equation. The Laplacian in the heat equation is shown to be a geometric analogue of the Laplacian of Riemannian geometry, although the maximum principle need not hold. It is then shown that if the flow is nonsin...

متن کامل

Csc5160: Combinatorial Optimization and Approximation Algorithms Topic: Min-max Theorem

In this lecture, we show the applications of the strong duality theorem, and discuss how to obtain min-max theorems and combinatorial algorithms from linear programming. We first introduce the 2 player, zero-sum game and show that this can be solved by minimax theorem and we also prove the minimax theorem by the LP-duality theorem. After that, we introduce some applications of minimax theorem, ...

متن کامل

Evolution of Yamabe constant under Ricci flow

In this note under a crucial technical assumption we derive a differential equality of Yamabe constant Y (g (t)) where g (t) is a solution of the Ricci flow on a closed n-manifold. As an application we show that when g (0) is a Yamabe metric at time t = 0 and Rgα n−1 is not a positive eigenvalue of the Laplacian ∆gα for any Yamabe metric gα in the conformal class [g0], then d dt ∣∣ t=0 Y (g (t)...

متن کامل

Transfomation of Non-feasible Inverse Maximum Flow Problem into a Feasible one by Flow Modification

A linear time method to decide if any inverse maximum flow (denoted IMFG) problem has solution is presented. For the case of IMFG not being feasible, a new inverse combinatorial optimization problem is introduced and solved. The problem is to modify as little as possible the flow so that the problem becomes feasible for the modified flow. Key–Words: inverse combinatorial optimization, maximum f...

متن کامل

Ant-Q Hyper Heuristic Approach applied to the Cross- domain Heuristic Search Challenge problems

The first Cross-domain Heuristic Search Challenge (CHeSC 2011) is an international research competition aimed at measuring hyperheuristics performance over several problem domains. Hyper-heuristics are new approaches which aim at raising the level of abstraction when solving combinatorial optimisation problems. During this competition, we have applied the Ant-Q hyper-heuristic approach, propose...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002